github.com/klauspost/compress/flate.tableEntry.offset (field)
204 uses
github.com/klauspost/compress/flate (current package)
fast_encoder.go#L69: offset int32
level1.go#L40: v := e.table[i].offset
level1.go#L46: e.table[i].offset = v
level1.go#L89: e.table[nextHash] = tableEntry{offset: s + e.cur}
level1.go#L92: offset := s - (candidate.offset - e.cur)
level1.go#L93: if offset < maxMatchOffset && uint32(cv) == load3232(src, candidate.offset-e.cur) {
level1.go#L94: e.table[nextHash] = tableEntry{offset: nextS + e.cur}
level1.go#L104: e.table[nextHash] = tableEntry{offset: s + e.cur}
level1.go#L106: offset = s - (candidate.offset - e.cur)
level1.go#L107: if offset < maxMatchOffset && uint32(cv) == load3232(src, candidate.offset-e.cur) {
level1.go#L108: e.table[nextHash] = tableEntry{offset: nextS + e.cur}
level1.go#L123: t := candidate.offset - e.cur
level1.go#L204: e.table[hashLen(cv, tableBits, hashBytes)] = tableEntry{offset: s + e.cur}
level1.go#L218: e.table[prevHash] = tableEntry{offset: o}
level1.go#L222: e.table[currHash] = tableEntry{offset: o + 2}
level1.go#L224: offset := s - (candidate.offset - e.cur)
level1.go#L225: if offset > maxMatchOffset || uint32(x) != load3232(src, candidate.offset-e.cur) {
level2.go#L38: v := e.table[i].offset
level2.go#L44: e.table[i].offset = v
level2.go#L87: e.table[nextHash] = tableEntry{offset: s + e.cur}
level2.go#L90: offset := s - (candidate.offset - e.cur)
level2.go#L91: if offset < maxMatchOffset && uint32(cv) == load3232(src, candidate.offset-e.cur) {
level2.go#L92: e.table[nextHash] = tableEntry{offset: nextS + e.cur}
level2.go#L102: e.table[nextHash] = tableEntry{offset: s + e.cur}
level2.go#L104: offset = s - (candidate.offset - e.cur)
level2.go#L105: if offset < maxMatchOffset && uint32(cv) == load3232(src, candidate.offset-e.cur) {
level2.go#L128: t := candidate.offset - e.cur
level2.go#L160: e.table[hashLen(cv, bTableBits, hashBytes)] = tableEntry{offset: s + e.cur}
level2.go#L169: e.table[nextHash] = tableEntry{offset: e.cur + i}
level2.go#L173: e.table[nextHash] = tableEntry{offset: e.cur + i + 2}
level2.go#L177: e.table[nextHash] = tableEntry{offset: e.cur + i + 4}
level2.go#L190: e.table[prevHash] = tableEntry{offset: o}
level2.go#L191: e.table[prevHash2] = tableEntry{offset: o + 1}
level2.go#L194: e.table[currHash] = tableEntry{offset: o + 2}
level2.go#L196: offset := s - (candidate.offset - e.cur)
level2.go#L197: if offset > maxMatchOffset || uint32(x>>16) != load3232(src, candidate.offset-e.cur) {
level3.go#L38: if v.Cur.offset <= minOff {
level3.go#L39: v.Cur.offset = 0
level3.go#L41: v.Cur.offset = v.Cur.offset - e.cur + maxMatchOffset
level3.go#L43: if v.Prev.offset <= minOff {
level3.go#L44: v.Prev.offset = 0
level3.go#L46: v.Prev.offset = v.Prev.offset - e.cur + maxMatchOffset
level3.go#L90: e.table[nextHash] = tableEntryPrev{Prev: candidates.Cur, Cur: tableEntry{offset: s + e.cur}}
level3.go#L94: if candidate.offset < minOffset {
level3.go#L100: if uint32(cv) == load3232(src, candidate.offset-e.cur) {
level3.go#L101: if candidates.Prev.offset < minOffset || uint32(cv) != load3232(src, candidates.Prev.offset-e.cur) {
level3.go#L105: offset := s - (candidate.offset - e.cur)
level3.go#L106: o2 := s - (candidates.Prev.offset - e.cur)
level3.go#L116: if candidate.offset > minOffset && uint32(cv) == load3232(src, candidate.offset-e.cur) {
level3.go#L137: t := candidate.offset - e.cur
level3.go#L173: Cur: tableEntry{offset: e.cur + t},
level3.go#L184: Cur: tableEntry{offset: e.cur + i}}
level3.go#L193: Cur: tableEntry{offset: e.cur + s - 2},
level3.go#L200: Cur: tableEntry{offset: e.cur + s - 1},
level3.go#L208: Cur: tableEntry{offset: s + e.cur},
level3.go#L215: if candidate.offset > minOffset {
level3.go#L216: if uint32(cv) == load3232(src, candidate.offset-e.cur) {
level3.go#L221: if candidate.offset > minOffset && uint32(cv) == load3232(src, candidate.offset-e.cur) {
level4.go#L35: v := e.table[i].offset
level4.go#L41: e.table[i].offset = v
level4.go#L44: v := e.bTable[i].offset
level4.go#L50: e.bTable[i].offset = v
level4.go#L96: entry := tableEntry{offset: s + e.cur}
level4.go#L100: t = lCandidate.offset - e.cur
level4.go#L101: if s-t < maxMatchOffset && uint32(cv) == load3232(src, lCandidate.offset-e.cur) {
level4.go#L106: t = sCandidate.offset - e.cur
level4.go#L107: if s-t < maxMatchOffset && uint32(cv) == load3232(src, sCandidate.offset-e.cur) {
level4.go#L112: lOff := nextS - (lCandidate.offset - e.cur)
level4.go#L113: if lOff < maxMatchOffset && load3232(src, lCandidate.offset-e.cur) == uint32(next) {
level4.go#L117: t = lCandidate.offset - e.cur
level4.go#L172: e.table[hashLen(cv, tableBits, hashShortBytes)] = tableEntry{offset: s + e.cur}
level4.go#L173: e.bTable[hash7(cv, tableBits)] = tableEntry{offset: s + e.cur}
level4.go#L183: t := tableEntry{offset: i + e.cur}
level4.go#L184: t2 := tableEntry{offset: t.offset + 1}
level4.go#L192: t := tableEntry{offset: i + e.cur}
level4.go#L193: t2 := tableEntry{offset: t.offset + 1}
level4.go#L207: e.table[prevHashS] = tableEntry{offset: o}
level4.go#L208: e.bTable[prevHashL] = tableEntry{offset: o}
level5.go#L36: v := e.table[i].offset
level5.go#L42: e.table[i].offset = v
level5.go#L46: if v.Cur.offset <= minOff {
level5.go#L47: v.Cur.offset = 0
level5.go#L48: v.Prev.offset = 0
level5.go#L50: v.Cur.offset = v.Cur.offset - e.cur + maxMatchOffset
level5.go#L51: if v.Prev.offset <= minOff {
level5.go#L52: v.Prev.offset = 0
level5.go#L54: v.Prev.offset = v.Prev.offset - e.cur + maxMatchOffset
level5.go#L104: entry := tableEntry{offset: s + e.cur}
level5.go#L112: t = lCandidate.Cur.offset - e.cur
level5.go#L114: if uint32(cv) == load3232(src, lCandidate.Cur.offset-e.cur) {
level5.go#L116: e.table[nextHashS] = tableEntry{offset: nextS + e.cur}
level5.go#L118: eLong.Cur, eLong.Prev = tableEntry{offset: nextS + e.cur}, eLong.Cur
level5.go#L120: t2 := lCandidate.Prev.offset - e.cur
level5.go#L121: if s-t2 < maxMatchOffset && uint32(cv) == load3232(src, lCandidate.Prev.offset-e.cur) {
level5.go#L132: t = lCandidate.Prev.offset - e.cur
level5.go#L133: if s-t < maxMatchOffset && uint32(cv) == load3232(src, lCandidate.Prev.offset-e.cur) {
level5.go#L135: e.table[nextHashS] = tableEntry{offset: nextS + e.cur}
level5.go#L137: eLong.Cur, eLong.Prev = tableEntry{offset: nextS + e.cur}, eLong.Cur
level5.go#L142: t = sCandidate.offset - e.cur
level5.go#L143: if s-t < maxMatchOffset && uint32(cv) == load3232(src, sCandidate.offset-e.cur) {
level5.go#L149: e.table[nextHashS] = tableEntry{offset: nextS + e.cur}
level5.go#L151: eLong.Cur, eLong.Prev = tableEntry{offset: nextS + e.cur}, eLong.Cur
level5.go#L154: t2 := lCandidate.Cur.offset - e.cur
level5.go#L156: if load3232(src, lCandidate.Cur.offset-e.cur) == uint32(next) {
level5.go#L166: t2 = lCandidate.Prev.offset - e.cur
level5.go#L167: if nextS-t2 < maxMatchOffset && load3232(src, lCandidate.Prev.offset-e.cur) == uint32(next) {
level5.go#L201: eLong := e.bTable[hash7(load6432(src, sAt), tableBits)].Cur.offset
level5.go#L260: t := tableEntry{offset: i + e.cur}
level5.go#L267: t = tableEntry{offset: t.offset + 1}
level5.go#L273: t = tableEntry{offset: t.offset + 1}
level5.go#L280: t := tableEntry{offset: i + e.cur}
level5.go#L281: t2 := tableEntry{offset: t.offset + 1}
level5.go#L295: e.table[prevHashS] = tableEntry{offset: o}
level5.go#L297: eLong.Cur, eLong.Prev = tableEntry{offset: o}, eLong.Cur
level5.go#L348: v := e.table[i].offset
level5.go#L354: e.table[i].offset = v
level5.go#L358: if v.Cur.offset <= minOff {
level5.go#L359: v.Cur.offset = 0
level5.go#L360: v.Prev.offset = 0
level5.go#L362: v.Cur.offset = v.Cur.offset - e.cur + maxMatchOffset
level5.go#L363: if v.Prev.offset <= minOff {
level5.go#L364: v.Prev.offset = 0
level5.go#L366: v.Prev.offset = v.Prev.offset - e.cur + maxMatchOffset
level5.go#L416: entry := tableEntry{offset: s + e.cur}
level5.go#L424: t = lCandidate.Cur.offset - e.cur
level5.go#L426: if uint32(cv) == load3232(src, lCandidate.Cur.offset-e.cur) {
level5.go#L428: e.table[nextHashS] = tableEntry{offset: nextS + e.cur}
level5.go#L430: eLong.Cur, eLong.Prev = tableEntry{offset: nextS + e.cur}, eLong.Cur
level5.go#L432: t2 := lCandidate.Prev.offset - e.cur
level5.go#L433: if s-t2 < maxMatchOffset && uint32(cv) == load3232(src, lCandidate.Prev.offset-e.cur) {
level5.go#L444: t = lCandidate.Prev.offset - e.cur
level5.go#L445: if s-t < maxMatchOffset && uint32(cv) == load3232(src, lCandidate.Prev.offset-e.cur) {
level5.go#L447: e.table[nextHashS] = tableEntry{offset: nextS + e.cur}
level5.go#L449: eLong.Cur, eLong.Prev = tableEntry{offset: nextS + e.cur}, eLong.Cur
level5.go#L454: t = sCandidate.offset - e.cur
level5.go#L455: if s-t < maxMatchOffset && uint32(cv) == load3232(src, sCandidate.offset-e.cur) {
level5.go#L461: e.table[nextHashS] = tableEntry{offset: nextS + e.cur}
level5.go#L463: eLong.Cur, eLong.Prev = tableEntry{offset: nextS + e.cur}, eLong.Cur
level5.go#L466: t2 := lCandidate.Cur.offset - e.cur
level5.go#L468: if load3232(src, lCandidate.Cur.offset-e.cur) == uint32(next) {
level5.go#L478: t2 = lCandidate.Prev.offset - e.cur
level5.go#L479: if nextS-t2 < maxMatchOffset && load3232(src, lCandidate.Prev.offset-e.cur) == uint32(next) {
level5.go#L513: eLong := e.bTable[hash7(load6432(src, sAt), tableBits)].Cur.offset
level5.go#L572: t := tableEntry{offset: i + e.cur}
level5.go#L579: t = tableEntry{offset: t.offset + 1}
level5.go#L585: t = tableEntry{offset: t.offset + 1}
level5.go#L592: t := tableEntry{offset: i + e.cur}
level5.go#L593: t2 := tableEntry{offset: t.offset + 1}
level5.go#L607: e.table[prevHashS] = tableEntry{offset: o}
level5.go#L609: eLong.Cur, eLong.Prev = tableEntry{offset: o}, eLong.Cur
level6.go#L36: v := e.table[i].offset
level6.go#L42: e.table[i].offset = v
level6.go#L46: if v.Cur.offset <= minOff {
level6.go#L47: v.Cur.offset = 0
level6.go#L48: v.Prev.offset = 0
level6.go#L50: v.Cur.offset = v.Cur.offset - e.cur + maxMatchOffset
level6.go#L51: if v.Prev.offset <= minOff {
level6.go#L52: v.Prev.offset = 0
level6.go#L54: v.Prev.offset = v.Prev.offset - e.cur + maxMatchOffset
level6.go#L105: entry := tableEntry{offset: s + e.cur}
level6.go#L114: t = lCandidate.Cur.offset - e.cur
level6.go#L116: if uint32(cv) == load3232(src, lCandidate.Cur.offset-e.cur) {
level6.go#L120: e.table[nextHashS] = tableEntry{offset: nextS + e.cur}
level6.go#L122: eLong.Cur, eLong.Prev = tableEntry{offset: nextS + e.cur}, eLong.Cur
level6.go#L125: t2 := lCandidate.Prev.offset - e.cur
level6.go#L126: if s-t2 < maxMatchOffset && uint32(cv) == load3232(src, lCandidate.Prev.offset-e.cur) {
level6.go#L138: t = lCandidate.Prev.offset - e.cur
level6.go#L139: if s-t < maxMatchOffset && uint32(cv) == load3232(src, lCandidate.Prev.offset-e.cur) {
level6.go#L141: e.table[nextHashS] = tableEntry{offset: nextS + e.cur}
level6.go#L143: eLong.Cur, eLong.Prev = tableEntry{offset: nextS + e.cur}, eLong.Cur
level6.go#L148: t = sCandidate.offset - e.cur
level6.go#L149: if s-t < maxMatchOffset && uint32(cv) == load3232(src, sCandidate.offset-e.cur) {
level6.go#L157: e.table[nextHashS] = tableEntry{offset: nextS + e.cur}
level6.go#L159: eLong.Cur, eLong.Prev = tableEntry{offset: nextS + e.cur}, eLong.Cur
level6.go#L176: t2 = lCandidate.Cur.offset - e.cur
level6.go#L178: if load3232(src, lCandidate.Cur.offset-e.cur) == uint32(next) {
level6.go#L188: t2 = lCandidate.Prev.offset - e.cur
level6.go#L189: if nextS-t2 < maxMatchOffset && load3232(src, lCandidate.Prev.offset-e.cur) == uint32(next) {
level6.go#L225: t2 := eLong.Cur.offset - e.cur - l + skipBeginning
level6.go#L237: t2 = eLong.Prev.offset - e.cur - l + skipBeginning
level6.go#L290: e.table[hashLen(cv, tableBits, hashShortBytes)] = tableEntry{offset: i + e.cur}
level6.go#L292: eLong.Cur, eLong.Prev = tableEntry{offset: i + e.cur}, eLong.Cur
level6.go#L301: t := tableEntry{offset: i + e.cur}
level6.go#L302: t2 := tableEntry{offset: t.offset + 1}
 |
The pages are generated with Golds v0.6.7. (GOOS=linux GOARCH=amd64)
Golds is a Go 101 project developed by Tapir Liu.
PR and bug reports are welcome and can be submitted to the issue list.
Please follow @Go100and1 (reachable from the left QR code) to get the latest news of Golds. |